Symmetric circular matchings and RNA folding
نویسندگان
چکیده
منابع مشابه
Memory Efficient Folding Algorithms for Circular RNA Secondary Structures
BACKGROUND A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward approach is to compute circular structures from 'internal' and 'external' substructures separated by a base pair. This is incompatible, however, with the memory-saving approach of the Vienna RNA Package whi...
متن کاملMaximum skew-symmetric flows and matchings
The maximum integer skew-symmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of self-conjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical results on usual network flows, such as the flow decomposition, augmenting path, and max-flow min-c...
متن کاملMatchings and Canonical Forms for Symmetric Tensors
Let V be a q-dimensional vector space. Fix a set B of q(q − 1) monomials in S(V ) of the form x where ik > 0 for all k. The generic element of S(V ) is conjugate under a suitable linear transformation to an element with support off of B. We prove this by showing the existence of a perfect matching with a unique weight in a certain weighted bipartite graph. Such a perfect matching corresponds to...
متن کاملRNA chaperones and the RNA folding problem.
Functional and structural inter-relationships of RNA and proteins in the execution and control of biological processes such as RNA processing, RNA splicing, and translation are increasingly apparent. In this minireview, I present an RNA chaperone hypothesis, which fosters the view that constraints imposed by fundamental problems in the folding of RNA have profoundly influenced the nature of RNA...
متن کاملRNA folding and combinatory landscapes.
In this paper we view the folding of polynucleotide (RNA) sequences as a map that assigns to each sequence a minimum free energy pattern of base pairings, known as secondary structure. Considering only the free energy leads to an energy landscape over the sequence space. Taking into account structure generates a less visualizable non-scalar "landscape", where a sequence space is mapped into a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.004